FRANCE JOINS IN

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Faster Joins , Self - Joins and

We propose a new algorithm, called Stripe-join, for performing a join given a join index. Stripe-join is inspired by an algorithm called \Jive-join" developed by Li and Ross. Stripe-join makes a single sequential pass through each input relation, in addition to one pass through the join index and two passes through a set of temporary les that contain tuple identiiers but no input tuples. Stripe...

متن کامل

Administrative Litigations in Iran and France

Administrative litigation is one of the most important issues of administrative law. The purpose of distinguishing between different types of administrative litigations is to explain the judicial procedures relating to each other. According to one of the most important classifications, proposed by Edouard Laferrière in the late nineteenth century and despite criticisms has retained its importan...

متن کامل

Connected Joins in Graphs

A join in a graph is a set F of edges such that for every circuit C, |C ∩ F | ≤ |C \ F |. We study the problem of finding a connected join covering a given subset of vertices of the graph, that is a Steiner tree which is a join at the same time. This turns out to contain the question of finding a T -join of minimum cardinality (or weight) which is, in addition, connected. This last problem is m...

متن کامل

Faster Joins, Self Joins and Multi-Way Joins Using Join Indices

We propose a new algorithm called Stripe join for performing a join given a join index Stripe join is inspired by an algorithm called Jive join developed by Li and Ross Stripe join makes a single sequential pass through each input relation in addition to one pass through the join index and two passes through a set of temporary les that contain tuple identi ers but no input tuples Stripe join pe...

متن کامل

Inspector Joins

The key idea behind Inspector Joins is that during the I/O partitioning phase of a hash-based join, we have the opportunity to look at the actual data itself and then use this knowledge in two ways: (1) to create specialized indexes, specific to the given query on the given data, for optimizing the CPU cache performance of the subsequent join phase of the algorithm, and (2) to decide which join...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Court Historian

سال: 2005

ISSN: 1462-9712,2056-3450

DOI: 10.1179/cou.2005.10.1.001